Daniel Marx

Results: 86



#Item
11

Constraint Solving via Fractional Edge Covers ´ Daniel Marx

Add to Reading List

Source URL: www.cs.bme.hu

Language: English - Date: 2007-10-29 10:16:14
    12

    Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs Martin Grohe Dániel Marx∗

    Add to Reading List

    Source URL: www.cs.bme.hu

    Language: English - Date: 2012-03-27 09:21:36
      13

      The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

      Add to Reading List

      Source URL: www.cs.bme.hu

      Language: English - Date: 2016-09-26 07:51:42
        14

        Structural complexity of CSPs: the role of treewidth and its generalizations ´ Daniel Marx Tel Aviv University, Israel

        Add to Reading List

        Source URL: www.cs.bme.hu

        Language: English - Date: 2009-10-28 09:35:29
          15

          Constraint Solving via Fractional Edge Covers ´ Martin Grohe and Daniel Marx

          Add to Reading List

          Source URL: www.cs.bme.hu

          Language: English - Date: 2007-10-29 10:18:00
            16

            Interval Deletion is fixed-parameter tractable Yixin Cao Dániel Marx Institute for Computer Science and Control

            Add to Reading List

            Source URL: www.cs.bme.hu

            Language: English - Date: 2014-01-06 08:59:29
              17

              Important separators and parameterized algorithms Dániel Marx Humboldt-Universität zu Berlin, Germany 37th International Workshop on Graph-Theoretic Methods in Computer Science Teplá Monastery, Czech Republic

              Add to Reading List

              Source URL: www.cs.bme.hu

              Language: English - Date: 2011-06-23 02:04:38
                18

                Minicourse on parameterized algorithms and complexity Part 6: Important Separators Dániel Marx Jagiellonian University in Kraków

                Add to Reading List

                Source URL: www.cs.bme.hu

                Language: English - Date: 2015-04-21 11:03:11
                  19

                  A PTAS for Planar Group Steiner Tree via Spanner Bootstrapping and Prize Collecting Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

                  Add to Reading List

                  Source URL: www.cs.bme.hu

                  Language: English - Date: 2016-06-23 07:26:21
                    20

                    The Optimality Program in Parameterized Algorithms Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

                    Add to Reading List

                    Source URL: www.cs.bme.hu

                    Language: English - Date: 2016-06-27 04:47:06
                      UPDATE